Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:
Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT
In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:
- come viene usata la parola
- frequenza di utilizzo
- è usato più spesso nel discorso orale o scritto
- opzioni di traduzione delle parole
- esempi di utilizzo (varie frasi con traduzione)
- etimologia
Cosa (chi) è reproduction typing - definizione
MAJOR CLASS OF TYPE SYSTEM, IN WHICH COMPATIBILITY AND EQUIVALENCE OF DATA TYPES IS DETERMINED BY EXPLICIT DECLARATIONS AND/OR THE NAME OF THE TYPES
Nominative typing; Nominal typing; Nominative type system
Nominal type system
In computer science, a type system is a nominal or nominative type system (or name-based type system) if compatibility and equivalence of data types is determined by explicit declarations and/or the name of the types. Nominal systems are used to determine if types are equivalent, as well as if a type is a subtype of another.
duck typing
STYLE OF DYNAMIC TYPING IN OBJECT-ORIENTED PROGRAMMING
Duck Typing; DuckTyping; Duck typed; Duck Type; Duck type
<programming> A term coined by Dave Thomas for a kind of
dynamic typing typical of some programming languages, such
as Smalltalk, Ruby or Visual FoxPro, where a
variable's run-time value determines the operations that
can be performed on it.
The term comes from the "duck test": if it walks like a duck
and quacks like a duck, it must be a duck.
Duck typing considers the methods to which a value responds
and the attributes it posesses rather than its relationship
to a type hierarchy. This encourages greater polymorphism
because types are enforced as late as possible.
http://blade.nagaokaut.ac.jp/cgi-bin/scat.rb/ruby/ruby-talk/100511.
(2006-09-13)
Latent typing
TYPE SYSTEM WHERE TYPES ARE ASSOCIATED WITH VALUES AND NOT VARIABLES
Implicit typing; Latent type
In computer programming, latent typing refers to a type system where types are associated with values and not variables. An example latently typed language is Scheme.
Wikipedia
Nominal type system
In computer science, a type system is a nominal or nominative type system (or name-based type system) if compatibility and equivalence of data types is determined by explicit declarations and/or the name of the types. Nominal systems are used to determine if types are equivalent, as well as if a type is a subtype of another. Nominal type systems contrast with structural systems, where comparisons are based on the structure of the types in question and do not require explicit declarations.
